The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9
نویسنده
چکیده
First Fit Decreasing is a classical bin packing algorithm: the items are ordered into their nonincreasing order, and then in this order the next item is always packed into the first bin where it fits. For an instance I let FFD(I) and OPT (I) denote the number of the used bins by algorithm FFD, and an optimal algorithm, respectively. We show in this paper that FFD(I) ≤ 11/9OPT (I) + 6/9, (1) and that this bound is tight. The tight bound of the additive constant was an open question for many years.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملMaximizing the number of unused bins
We analyze the approximation behavior of some of the best-known polynomial-time approximation algorithms for bin-packing under an approximation criterion, called differential ratio, informally the ratio (n − λ(I))/(n − β(I)), where n is the size of the input list, λ(I) is the size of the solution provided by an approximation algorithm and β(I) is the size of the optimal one. This measure has or...
متن کاملFinal Year Project Plan
The bin packing problem is a well-studied combinatorial NP-hard problem. In the bin packing problem, a sequence of items are packed into bins, the packed items in a bin do not overlap. The objective is to minimize the number of used bins. The size of each item should be no more than the size of a bin. (Zhang, 2011) The algorithms can be divided into two categories: offline algorithm, requiring ...
متن کاملBin-Packing Problem with Concave Costs of Bin Utilization
We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied...
متن کاملParallel Approximation Algorithms for Bin Packing
We study the parallel complexity of polynomial heuristics for the bin packing problem. We show that some well-known (and simple) methods like first-fit-decreasing are P-complete, and it is hence very unlikely that they can be efficiently parallelized. On the other hand, we exhibit an optimal NC algorithm that achieves the same performance bound as does FFD. Finally, we discuss parallelization o...
متن کامل